Determinizing monitors for HML with recursion
نویسندگان
چکیده
منابع مشابه
Determinizing Monitors for HML with Recursion
We examine the determinization of monitors for HML with recursion. We demonstrate that every monitor is equivalent to a deterministic one, which is at most doubly exponential in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly exponential bound is optimal. When (deterministic) monitors are described as finite automata (as their LTS), then...
متن کاملOn the Complexity of Determinizing Monitors
We examine the determinization of monitors. We demonstrate that every monitor is equivalent to a deterministic one, which is at most doubly exponential in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly-exponential bound is optimal. When (deterministic) monitors are described as finite automata (as their LTS), then they can be exponentia...
متن کاملDeterminizing Discounted-Sum Automata
A discounted-sum automaton (NDA) is a nondeterministic finite automaton with edge weights, which values a run by the discounted sum of visited edge weights. More precisely, the weight in the i-th position of the run is divided by λ, where the discount factor λ is a fixed rational number greater than 1. Discounted summation is a common and useful measuring scheme, especially for infinite sequenc...
متن کاملSynthesising correct concurrent runtime monitors
We study the correctness of automated synthesis for concurrent monitors. We adapt HML, a subset of the Hennessy-Milner logic with recursion, to specify safety properties of Erlang programs, and define an automated translation from HML formulas to Erlang monitors so as to detect formula violations at runtime. We then formalise monitor correctness for our concurrent setting and describe a techn...
متن کاملDeterminizing Asynchronous Automata on Infinite Inputs
Asynchronous automata are a natural distributed machine model for recognizing trace languages—languages defined over an alphabet equipped with an independence relation. To handle infinite traces, Gastin and Petit introduced Büchi asynchronous automata, which accept precisely the class of ω-regular trace languages. Like their sequential counterparts, these automata need to be non-deterministic i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2020
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2019.100515